Comparison of an O(N) and an O(N log N) N-Body Solver
نویسنده
چکیده
In this paper we compare the performance characteristics of two 3-dimensional hierarchical N-body solvers: an O(N) and an O(N logN) solver. We present the execution times for numerous N-body force evaluations using the two methods, with various values of N and , where is the prescribed error. We nd that the O(N logN) method is more suited to problems which demand a high precision and large N. We then consider how parallelisation aaects the algorithms' relative performance.
منابع مشابه
Fr{'e}chet and Hausdorff Queries on $x$-Monotone Trajectories
vspace{0.2cm}In this paper, we design a data structure for the following problem. Let $pi$ be an $x$-monotone trajectory with $n$ vertices in the plane and $epsilon >0$. We show how to preprocess $pi$ and $epsilon$ into a data structure such that for any horizontal query segment $Q$ in the plane, one can quickly determine the minimal continuous fraction of $pi$ whose Fr{'e}chet and Hausdo...
متن کاملAn approach based on statistical spline model for Volterra-Fredholm integral equations
In this paper, an approach based on statistical spline model (SSM) and collocation method is proposed to solve Volterra-Fredholm integral equations. The set of collocation nodes is chosen so that the points yield minimal error in the nodal polynomials. Under some standard assumptions, we establish the convergence property of this approach. Numerical results on some problems are given...
متن کاملAn interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function
In this paper, an interior-point algorithm for $P_{ast}(kappa)$-Linear Complementarity Problem (LCP) based on a new parametric trigonometric kernel function is proposed. By applying strictly feasible starting point condition and using some simple analysis tools, we prove that our algorithm has $O((1+2kappa)sqrt{n} log nlogfrac{n}{epsilon})$ iteration bound for large-update methods, which coinc...
متن کاملDirected domination in oriented hypergraphs
ErdH{o}s [On Sch"utte problem, Math. Gaz. 47 (1963)] proved that every tournament on $n$ vertices has a directed dominating set of at most $log (n+1)$ vertices, where $log$ is the logarithm to base $2$. He also showed that there is a tournament on $n$ vertices with no directed domination set of cardinality less than $log n - 2 log log n + 1$. This notion of directed domination number has been g...
متن کاملOn semi maximal filters in BL-algebras
In this paper, first we study the semi maximal filters in linear $BL$-algebras and we prove that any semi maximal filter is a primary filter. Then, we investigate the radical of semi maximal filters in $BL$-algebras. Moreover, we determine the relationship between this filters and other types of filters in $BL$-algebras and G"{o} del algebra. Specially, we prove that in a G"{o}del algebra, any ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995